Visual Cryptography ( VC ) using Zigzag Scan Approach
نویسنده
چکیده
This paper proposes a new method of Visual Secret Sharing using Zigzag Scan approach. Non-expanded shares are generated by this scheme. This overcomes the drawback of Hilbert Curve approach, that is, the input should be a square image of size which is an integral power of 2.
منابع مشابه
A Zero-Watermark Scheme for Identification Photos based on QR Code and Visual Cryptography
This paper proposes a zero-watermark scheme for identification photos based on QR code and visual cryptography. The method makes no changes to original images while embedding the QR code watermark. In order to ensure the security, we use Arnold transformation to scrambling the watermark. In the scheme, we use discrete wavelet transform and matrix norm computing to generate the invariant feature...
متن کاملImprove Display Quality of Stacked Image in Visual Cryptography Using SA algorithm
-In visual cryptography (VC) suffers from a pixel-expansion problem, or an out of control display quality problem for improved images(II), and lacks a general approach to construct visual secret sharing schemes (VSSs) for Common Admission Structures (CASs). The propose herein a general and efficient approach to address these issues without difficult blueprint. The efficient approach can be used...
متن کاملAn Extended Visual Cryptography Algorithm for Quality-Improved Gray Scale Image with Sigmoid Function
Conventional visual secret sharing schemes generate noise-like random pixels on shares to hide secret images. It suffers amanagement problem, because of which dealers cannot visually identify each share. This problem is solved by the extended visual cryptography scheme (EVCS), which adds ameaningful cover image in each share. However, the previous approaches involving the EVCS for general acces...
متن کاملBasic Visual Cryptography Using Braille
As a significant part of information security, Visual Cryptography (VC) is a secret sharing approach which has the advantage of effectively obscuring hints of original secret. In VC, a secret image is separated into partitions which are also known as VC shares. The secret is only able to be revealed by superimposing certain shares. Since Basic VC is in a structure which is similar to that of Br...
متن کاملImprove Display Quality of Symmetric Image Size for Common Admission Structures in Visual Cryptography
In visual cryptography (vc) suffers from a pixel-expansion problem, or an out of control display quality problem for improved images(ii), and lacks a general approach to construct visual secret sharing schemes (vsss) for common admission structures (cass). The propose herein a general and efficient approach to address these issues without difficult blueprint. The efficient approach can be used ...
متن کامل